Dynamic Competitive Resource Sharing in Multimedia Networks

Abstract: In this paper, we develop a methodology for dynamic resource sharing in multimedia networks with competing traffic types. We introduce dynamic queueing models for multimedia traffic types, as well as approximate linearized dynamic queueing models. We formulate the problem as an dynamic non-cooperative Nash game and state the conditions for non-cooperative equilibrium. Finally, we propose load sharing, routing and admission control algorithms, which state that each traffic type should be allocated only on paths and destinations that minimize its Hamiltonian.